Containment problem and combinatorics
نویسندگان
چکیده
منابع مشابه
Polyhedral combinatorics and the acyclic subdigraph problem
In undergoing this life, many people always try to do and get the best. New knowledge, experience, lesson, and everything that can improve the life will be done. However, many people sometimes feel confused to get those things. Feeling the limited of experience and sources to be better is one of the lacks to own. However, there is a very simple thing that can be done. This is what your teacher ...
متن کاملOn the Containment Problem for Linear Sets
It is well known that the containment problem (as well as the equivalence problem) for semilinear sets is log-complete in Πp2. In this paper, we show that already the containment problem for linear sets is log-hard (and therefore also log-complete) in Πp2. This holds even when we use a unary encoding for the numerical input parameters or when we restrict the problem to 1-dimensional linear sets...
متن کاملCombinatorics of the change-making problem
We investigate the structure of the currencies (systems of coins) for which the greedy change-making algorithm always finds an optimal solution (that is, a one with minimum number of coins). We present a series of necessary conditions that must be satisfied by the values of coins in such systems. We also uncover some relations between such currencies and their sub-currencies.
متن کاملThe Resurgence of Ideals of Points and the Containment Problem
We relate properties of linear systems on X to the question of when I contains I(m) in the case that I is the homogeneous ideal of a finite set of distinct points p1, . . . , pn ∈ P , where X is the surface obtained by blowing up the points. We obtain complete answers for when I contains I(m) when the points pi lie on a smooth conic, or when the points are general and n ≤ 9.
متن کاملUnderstanding morphogen gradients: a problem of dispersion and containment.
Protein morphogens are instructive signals that regulate growth and patterning of tissues and organs. They form long-range, dynamic gradients by moving from regions of high concentration (producing cells) to regions of low concentration (the adjacent, nonproducing developmental field). Since morphogen activity must be limited to the adjacent target field, we want to understand both how signalin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2018
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-018-0838-y